Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm
نویسنده
چکیده
In this paper we consider the following problem: Given a set A ° of n lines in the plane, partition the plane into O(r 2) triangles so that no triangle meets more than O(n/r) lines of .~. We present a deterministic algorithm for this problem with O(nr log n log ° r) running time, where co is a constant < 3.33.
منابع مشابه
Parititoning Arrangements of Lines II: Applications
In this paper we present efficient deterministic algorithms for various problems involving lines or segments in the plane, using the partitioning algorithm described in a companion paper [A3]. These applications include: (i) an O(m2/3n 2/3.10g 2/3 n-log ~t3 (mix~n) + (m + n) log n) algorithm to compute all incidences between m points and n lines, where o) is a constant < 3.33; (ii) an O(m2/3n 2...
متن کامل- - - - Computational Geometry Bibliography 1 1
Zuni´c. On the maximal number of edges of convex digital polygons included into a square grid. A simplex variant solving an m ×d linear program in O (min(m 2 , d 2)) expected number of pivot steps. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. 12 P. K. Agarwal. A deterministic algorithm for partitioning arrangements of lin...
متن کاملAn Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm
In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملAn Efficient Algorithm for Output Coding in Pal Based Cplds (TECHNICAL NOTE)
One of the approaches used to partition inputs consists in modifying and limiting the input set using an external transcoder. This method is strictly related to output coding. This paper presents an optimal output coding in PAL-based programmable transcoders. The algorithm can be used to implement circuits in PAL-based CPLDs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 5 شماره
صفحات -
تاریخ انتشار 1990